Location:
Search - quick sort
Search list
Description: 虽然只有一个文件，但里面包含了较为全面的排序算法，包括：选择排序、插入排序、冒泡排序、堆排序、快速排序、归并排序、基排序、桶排序等，并包含了各个排序算法的对比。采用java的泛型结构实现的，具有很高的学习价值。-Although only one file, which contains a more comprehensive ranking algorithm include: selection sort, insertion sort, bubble sort, heap sort, quick sort, merge sort, based sort, bucket sort, and includes various sorting algorithms contrast. Using java generic structure, has a high learning value.
Platform: |
Size: 6144 |
Author: 汤捷 |
Hits:
Description: 常见的排序算法，包括简单排序，直接选择排序，插入排序，冒泡排序，希尔排序，快速排序等-Common sorting algorithms, including the simple sort, selection sort, insertion sort, bubble sort, shell sort, quick sort, etc.
Platform: |
Size: 2847744 |
Author: icy |
Hits:
Description: 用MFC实现的关于内部排序算法的时间比较,包括快速排序序,堆排序,选择排序等五种排序方法，已通过测试。
-Time on internal sorting algorithm is implemented by MFC, including five quick sort order, heap sort, selection sort sorting method has been tested.
Platform: |
Size: 31744 |
Author: 奉献 |
Hits:
Description: 算法导论实验报告 各种排序算法的实现 插入排序、冒泡排序、堆排序、快速排序、归并排序、基数排序、计数排序-Introduction to Algorithms, experiment reports a variety of sorting algorithms for insertion sort, bubble sort, heap sort, quick sort, merge sort, radix sort, counting sort
Platform: |
Size: 600064 |
Author: 婷 |
Hits:
Description: c语言快速排序算法简单实现-quick sort
Platform: |
Size: 185344 |
Author: zhang |
Hits:
Description: 本程序主要是利用人工智能的方法来实现重排九宫问题，通过构建启发式函数来实现快速排序，比深度优先遍历效果更好-This procedure is the use of artificial intelligence methods to realize the the Jiugong problems rearrangement, by constructing a heuristic function to achieve the quick sort, better than depth-first traversal effects
Platform: |
Size: 3072 |
Author: 萌萌 |
Hits:
Description: 输入一组数，快速排序，然后查找某个数，利用二分法查找-Enter a number, quick sort, and then find a number, use dichotomy to find
Platform: |
Size: 1024 |
Author: sww |
Hits:
Description: C++排序算法中，由冒泡排序演化而来的快速排序法与其改进-Quick Sort Bubble Sort evolved its improvement
Platform: |
Size: 2048 |
Author: yuanqiang |
Hits:
Description: 重写的经典huffman算法,本类融合了快速排序,插入排序,压缩阶段:每个assic从根递归写入一个DWORD中,当写满DWORD的32位的时候,写入一次内存压缩快>然后循环
解压过程:每次读取一个DWORD长度数据再反响循环&过滤该从左还是右子树进行还原当到达叶节点时候,读取对应节点的assic编码
再加压与解压末尾时候会出现不满足4个字节的数据,我把它们简称为补码,用来效验最终文件大小.-Huffman algorithm rewrite the classic blend of quick sort, insertion sort, the compression stage: each assic from root recursive write a DWORD When filled DWORD 32-bit write-once memory compression fast> and cycle decompression process: each read a DWORD length data again repercussions circulation & filtration that from the left or right subtree restore time when the leaf node is reached, the assic coding and then read the corresponding node pressurization and decompression will appear at the end of time does not meet four bytes of data, I referred to as the complement of the final file size for efficacy.
Platform: |
Size: 5120 |
Author: 杨斌 |
Hits:
Description: 用并行mpi进行快速排序 用并并行mpi进行快速排序
-Quick sort using parallel mpi parallel mpi quicksort
Platform: |
Size: 2048 |
Author: 察觉 |
Hits:
Description: 内排序系统，提供快速排序、冒泡排序、堆排序等常见排序代码。-Within the sorting system, providing quick sort, bubble sort, heap sort common sort code.
Platform: |
Size: 6144 |
Author: ci |
Hits:
Description: 各种基本排序的代码和讲解 很详细 包括冒泡排序 快速排序等-Sort code and explained in great detail, including bubble sort quick sort
Platform: |
Size: 641024 |
Author: tangqiansheng |
Hits:
Description: 步骤：设有一待排序的序列
1、分别设置low、high指向序列的最左端、最右端；从序列中选一个进行排序（通常选最左端的值low指向的值），存入到tmp；
2、从high端开始，查找比tmp小的，找到后将该值放入到low指向的存储位中；同时将high指向当前查到的值所在的位；
3、从low端开始，查找比tmp大的，找到后将该值放入到high指向的存储为中，同时low指向当前查到的值所在位；
4、若low位小于high位，返回步骤2；否则，将tmp值存入到空出来的low+1指向的位置，退出，返回low所在的位置position；
5、以position为界，将序列分成两部分，分别对两部分进行排序。-quick sort
Platform: |
Size: 6144 |
Author: 马艳娟 |
Hits:
Description: 快速排序法（quick sort）是目前所公认最快的排序方法之一.它最容易理解，也最符合轴心分割与左右进行排序的概念，适合对初学者进行讲解-Quicksort method (quick sort) is now recognized as one of the fastest sorting method. Easiest to understand, is most consistent with the the axis divided left and right sort of concept to explain, suitable for beginners
Platform: |
Size: 5120 |
Author: 刘丹 |
Hits:
Description: 简单选择排序、快速排序、直接插入排序、堆排序、希尔排序、冒泡排序等六种。
-Simple selection sort, quick sort, direct insertion sort, heap sort, shell sort, bubble sort, and six.
Platform: |
Size: 2048 |
Author: 刘源 |
Hits:
Description: 撰写一个程序，能够构建字符串型的二叉排序树并在二叉排序树中查找节点。
所谓二叉排序树，简而言之，是一个每个节点可指向 0、1 或 2 个节点的递归的数据结构。最上层的一个节点称为树根。二叉排序树服从凡是比当前节点小的值都在其左下方，比当前节点大的值都在其右下方的规律。该规律不仅适用于树的局部，也适用于整棵二叉排序树。建树后，请根据给定的字符串，查找树中是否有该节点。若有，返回其节点在所在的层次数（根节点Kiwi的层次定义为0）；若无，返回“Not Found”。
输入：
每行一个字符串，作为要插入二叉排序树的值。若单独一个*字符占一行，则表明用于建树的字符串输入数据结束。随后以[Search]开始的若干行，代表要在树中查找某个字符串值，用于查找的字符串紧跟其后。
若输入行的第一个字符为“#”，则表示输入数据结束。
输出：
输出每个要查找的值所在的层次数。-Binary sort tree，a way of quick sorting
Platform: |
Size: 1024 |
Author: 冰汐靥 |
Hits:
Description: （1）对以下6种常用的内部排序算法进行比较：起泡排序、直接插入排序、简单易懂选择排序、快速排序、希尔排序、堆排序。（2）待排序表的表长不小于100；其中的数据要用伪随机数产生程序源码产生；至少要要用5组不同的输输入数据作比较；比较的指标为有关键字参加的比较次数与关键字的移动次数（关键字交换计为3次移动）。（3）最后要对结果作出简单易懂分析，包含对各组数据的出结果波动大小的解释。 可直接使
-(1) to compare the following six kinds of commonly used internal sorting algorithm: bubble sort, insertion sort, the straightforward selection sort, quick sort, shell sort, heap sort. (2) Subject to the table length of the sort table is not less than 100 which data to use a pseudo random number generating program source want to use at least five different output of input data for comparison indicators comparing keyword participate moving times of the number of comparisons with keywords (keyword exchange counts as 3 mobile). (3) Finally the results to make a straightforward analysis, including for each set of data out of the interpretation of the results fluctuate size. Directly to
Platform: |
Size: 1024 |
Author: liming |
Hits:
Description: 课程设计项目，关于快速排序，实现多种快速排序，并进行对比。-Course design project, quicksort, to achieve a variety of quick sort and compare.
Platform: |
Size: 4558848 |
Author: lee |
Hits:
Description: 排序算法：利用多种方式实现对一个数字序列的快速排序-Sorting algorithm: a variety of ways to achieve a quick sort of a sequence of numbers
Platform: |
Size: 1024 |
Author: 刘基 |
Hits:
Description: 自定义数组长度的快速排序-Quick sort of self-defined array length
Platform: |
Size: 1024 |
Author: 陈国君 |
Hits:
«
1
2
...
45
46
47
48
49
50»